Modified RSA Algorithm with CRT & OAEP

The most active subjects in the security related communities are the necessary protection against the data thieves. This gives an importance and the value of exchanged data over the Internet or other media types. In many RSA cryptosystems, we usually select a small value for the public key e. This kind of choice can only speed up the encryption operation but do not forget that by this way, the corresponding decryption operation requires more computational time and therefore it costs more because of the larger decryption exponent d. The alternative way that can be taken to overcome this problem is to implement this operation is based on the Chinese Remainder theorem (CRT). This paper deals with implementation of RSA algorithm using Chinese remainder Theorem. To provide extra layer of encryption we will use Optimal Asymmetric Encryption Padding (OAEP) and Variable Radix Number System. Keywords— Encryption, Decryption, RSA Algorithm, CRT, Optimal Asymmetric Encryption Padding, Hash Algorithm .